Arbitrary sequence RAMs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arbitrary Sequence RAMs

It is known that in some cases a Random Access Machine (RAM) benefits from having an additional input that is an arbitrary number, satisfying only the criterion of being sufficiently large. This is known as the ARAM model. We introduce a new type of RAM, which we refer to as the Arbitrary Sequence RAM (ASRAM), that generalises the ARAM by allowing the generation of additional arbitrary large nu...

متن کامل

RAMs and TMs

A word-RAM consists of: • A fixed set of instructions P1, . . . , Pq. Allowed instructions are: – Modular arithmetic and integer division on registers; the standard model for a RAM machine does not have negative numbers, but you can verify that allowing signed integers doesn’t chance the power of the model. – Bitwise operations on registers. – Loading a constant into a register. – Transfering v...

متن کامل

Matrix representations of a special polynomial sequence in arbitrary dimension

This paper provides an insight into different structures of a special polynomial sequence of binomial type in higher dimensions with values in a Clifford algebra. The elements of the special polynomial sequence are homogeneous hypercomplex differentiable (monogenic) functions of different degrees and their matrix representation allows to prove their recursive construction in analogy to the comp...

متن کامل

Fast Time Sequence Indexing for Arbitrary Lp Norms

Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean distance and its derivatives. We examine the problem of multimodal similarity search in which users can choose the best one from multiple similarity models for their needs. In this paper, we present a novel and fast i...

متن کامل

Non-approximability of weighted multiple sequence alignment for arbitrary metrics

We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard for arbitrary metric scoring functions over the binary alphabet. This holds even when the weights are restricted to zero and one.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2015

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2014.09.010